By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Optimization

Table of Contents
Search This Issue
Volume 12, Issue 2, pp. 283-573

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Analysis of Inexact Trust-Region SQP Algorithms

Matthias Heinkenschloss and Luis N. Vicente

pp. 283-302

BibTeX  Abstract Full Text:  PDF

On the Resolution of the Generalized Nonlinear Complementarity Problem

Roberto Andreani, Ana Friedlander, and Sandra A. Santos

pp. 303-321

BibTeX  Abstract Full Text:  PDF

Measuring the Goodness of Orthogonal Array Discretizations for Stochastic Programming and Stochastic Dynamic Programming

Victoria C. P. Chen

pp. 322-344

BibTeX  Abstract Full Text:  PDF

Tighter Linear and Semidefinite Relaxations for Max-Cut Based on the Lovász--Schrijver Lift-and-Project Procedure

Monique Laurent

pp. 345-375

BibTeX  Abstract Full Text:  PDF

An Augmented Lagrangian Function with Improved Exactness Properties

Gianni Di Pillo and Stefano Lucidi

pp. 376-406

BibTeX  Abstract Full Text:  PDF

An Appropriate Subdifferential for Quasiconvex Functions

Aris Daniilidis, Nicolas Hadjisavvas, and Juan-Enrique Martinez-Legaz

pp. 407-420

BibTeX  Abstract Full Text:  PDF

Sufficient Conditions for Error Bounds

Zili Wu and Jane J. Ye

pp. 421-435

BibTeX  Abstract Full Text:  PDF

Smoothing Functions for Second-Order-Cone Complementarity Problems

Masao Fukushima, Zhi-Quan Luo, and Paul Tseng

pp. 436-460

BibTeX  Abstract Full Text:  PDF

A Variational Principle for Problems with Functional Constraints

A. D. Ioffe, R. E. Lucchetti, and J. P. Revalski

pp. 461-478

BibTeX  Abstract Full Text:  PDF

The Sample Average Approximation Method for Stochastic Discrete Optimization

Anton J. Kleywegt, Alexander Shapiro, and Tito Homem-de-Mello

pp. 479-502

BibTeX  Abstract Full Text:  PDF

Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs

Samuel Burer, Renato D. C. Monteiro, and Yin Zhang

pp. 503-521

BibTeX  Abstract Full Text:  PDF

A Primal-Dual Algorithm for Solving Polyhedral Conic Systems with a Finite-Precision Machine

Felipe Cucker and Javier Peña

pp. 522-554

BibTeX  Abstract Full Text:  PDF

A Class of Globally Convergent Optimization Methods Based on Conservative Convex Separable Approximations

Krister Svanberg

pp. 555-573

BibTeX  Abstract Full Text:  PDF